Towards a software/knowware Co-engineeringRUQIAN LU.Lecture notes in computer science. 2006, pp 23-32, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 10 p.Conference Paper

Combining topological and directional information : First resultsSANJIANG LI.Lecture notes in computer science. 2006, pp 252-264, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 13 p.Conference Paper

Modeling strategic beliefs with outsmarting belief systemsFADEL, Ronald.Lecture notes in computer science. 2006, pp 102-113, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 12 p.Conference Paper

Knowledge science, engineering and management (First international conference, KSEM 2006, Guilin, China, August 5-8, 2006)Lang, Jérôme; Lin, Fangzhen; Wang, Ju et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-37033-1, 1Vol, XV-664 p, isbn 3-540-37033-1Conference Proceedings

An outline of a formal ontology of genresGARBACZ, Pawel.Lecture notes in computer science. 2006, pp 151-163, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 13 p.Conference Paper

Logique possibilité: aspects formels, déduction automatique, et applications = Possibilistic logic: formal aspects, automated deduction, and applicationsLang, Jérôme; Prade, Henri.1991, 280 p.Thesis

Measuring conflict between possibilistic uncertain information through belief function theoryWEIRU LIU.Lecture notes in computer science. 2006, pp 265-277, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 13 p.Conference Paper

Reasoning under inconsistency: A forgetting-based approachLANG, Jérôme; MARQUIS, Pierre.Artificial intelligence (General ed.). 2010, Vol 174, Num 12-13, pp 799-823, issn 0004-3702, 25 p.Article

Raisonnement non monotone, QBF et programmation par ensembles réponses. Hommage à Pascal NicolasLANG, Jérôme; MARQUIS, Pierre.Revue d'intelligence artificielle. 2012, Vol 26, Num 1-2, issn 0992-499X, 192 p.Serial Issue

Some representation and computational issues in social choiceLANG, Jérome.Lecture notes in computer science. 2005, pp 15-26, issn 0302-9743, isbn 3-540-27326-3, 12 p.Conference Paper

THIRD INTERNATIONAL WORKSHOP ON LOGIC, RATIONALITY AND INTERACTION (LORI-III) IN GUANGZHOUVAN DITMARSCH, Hans; LANG, Jérôme.Synthese (Dordrecht). 2013, Vol 190, issn 0039-7857, 164 p., SUP1Conference Proceedings

On propositional definabilityLANG, Jérome; MARQUIS, Pierre.Artificial intelligence. 2008, Vol 172, Num 8-9, pp 991-1017, issn 0004-3702, 27 p.Article

A framework for automated test generation in intelligent tutoring systemsTANG SUQIN; CAO CUNGEN.Lecture notes in computer science. 2006, pp 392-404, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 13 p.Conference Paper

Enumerating minimal explanations by minimal hitting set computationSATOH, Ken; UNO, Takeaki.Lecture notes in computer science. 2006, pp 354-365, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 12 p.Conference Paper

Toward formalizing usefulness in propositional languageYI ZHOU; XIAOPING CHEN.Lecture notes in computer science. 2006, pp 650-661, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 12 p.Conference Paper

On text mining algorithms for automated maintenance of hierarchical knowledge directoryKIM, Han-Joon.Lecture notes in computer science. 2006, pp 202-214, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 13 p.Conference Paper

A case study for CTL model updateYULIN DING; YAN ZHANG.Lecture notes in computer science. 2006, pp 88-101, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 14 p.Conference Paper

Description and generation of computational agentsNERUDA, Roman; BEUSTER, Gerd.Lecture notes in computer science. 2006, pp 318-329, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 12 p.Conference Paper

Knowledge reduction in incomplete systems based on γ-tolerance relationWEI, Da-Kuan.Lecture notes in computer science. 2006, pp 504-513, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 10 p.Conference Paper

Marker-passing inference in the scone knowledge-base systemFAHLMAN, Scott E.Lecture notes in computer science. 2006, pp 114-126, issn 0302-9743, isbn 3-540-37033-1, 1Vol, 13 p.Conference Paper

Un panorama sur les procédures de décision séquentielles pour le problème de validité des formules booléennes quantifiées = A survey of the sequential decision procedures for the validity problem of quantified boolean formulasSTEPHAN, Igor.Revue d'intelligence artificielle. 2012, Vol 26, Num 1-2, pp 163-196, issn 0992-499X, 34 p.Article

Effectivity functions and efficient coalitions in Boolean gamesBONZON, Elise; LAGASQUIE-SCHIEX, Marie-Christine; LANG, Jérôme et al.Synthese (Dordrecht). 2012, Vol 187, pp 73-103, issn 0039-7857, 31 p., SUP1Article

Incentive engineering for Boolean gamesWOOLDRIDGE, Michael; ENDRISS, Ulle; KRAUS, Sarit et al.Artificial intelligence (General ed.). 2013, Vol 195, pp 418-439, issn 0004-3702, 22 p.Article

Belief extrapolation (or how to reason about observations and unpredicted change)DUPIN DE SAINT-CYR, Florence; LANG, Jérôme.Artificial intelligence (General ed.). 2011, Vol 175, Num 2, pp 760-790, issn 0004-3702, 31 p.Article

When are elections with few candidates hard to manipulate?CONITZER, Vincent; SANDHOLM, Tuomas; LANG, Jérome et al.Journal of the Association for Computing Machinery. 2007, Vol 54, Num 3, issn 0004-5411, D1-D33Article